3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
const int N = 2e5 + 1000;
int n, rt, sum, tot;
double VS, sd, d[N], ans2 = 1e10;
int ans1, head[N], vis[N];
struct node {
  int nex, to, val;
} a[N << 1];
void add(int f, int to, int v) {
  a[++tot].nex = head[f];
  a[tot].to = to;
  a[tot].val = v;
  head[f] = tot;
}
int w[N], mx[N], siz[N], v[N];
void getrt(int now, int fa) {
  mx[now] = 0;
  siz[now] = 1;
  for (int i = head[now], to; i; i = a[i].nex) {
    to = a[i].to;
    if (to == fa || vis[to]) continue;
    getrt(to, now);
    siz[now] += siz[to];
    mx[now] = max(mx[now], siz[to]);
  }
  mx[now] = max(mx[now], sum - siz[now]);
  if (mx[rt] > mx[now]) rt = now;
}
void calc(int now, int fa, int o, int v) {
  VS += pow(v, 1.5) * w[now];
  d[o] += pow(v, 0.5) * 1.5 * w[now];
  for (int i = head[now], to; i; i = a[i].nex) {
    to = a[i].to;
    if (to == fa) continue;
    calc(to, now, o, v + a[i].val);
  }
}
void dfs(int now) {
  getrt(now, 0);
  now = rt;
  getrt(now, 0);
  if (vis[now]) return;
  vis[now] = 1;
  VS = sd = 0;
  for (int i = head[now], to; i; i = a[i].nex) {
    to = a[i].to;
    d[to] = 0;
    calc(to, now, to, a[i].val);
    sd += d[to];
  }
  if (VS < ans2) ans1 = now, ans2 = VS;
  for (int i = head[now], to; i; i = a[i].nex) {
    to = a[i].to;
    if (sd - 2 * d[to] >= 0) continue;
    sum = siz[to];
    dfs(to);
    break;
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1, x, y, z; i < n; i++) {
    x = read();
    y = read();
    z = read();
    add(x, y, z);
    add(y, x, z);
  }
  mx[0] = sum = n;
  dfs(1);
  cout << ans1 << " " << ans2 << "\n";
}
