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;
const int N = 400000 + 20;
long long G, cnt, n, pos, head[N], size[N], a[N];
double len[N << 1], ans;
bool vis[N];
struct node {
  long long to, next;
  long long dis;
};
node p[N << 1];
void addedge(long long x, long long y, long long z) {
  cnt++;
  p[cnt].to = y;
  p[cnt].next = head[x];
  p[cnt].dis = z;
  head[x] = cnt;
}
void find_G(long long x, long long fa, long long al) {
  size[x] = 1;
  long long mx = 0;
  for (long long i = head[x]; i; i = p[i].next) {
    long long y = p[i].to;
    if (y != fa && !vis[y]) {
      find_G(y, x, al);
      size[x] += size[y];
      mx = max(mx, size[y]);
    }
  }
  mx = max(mx, al - size[x]);
  G = mx << 1 <= al ? x : G;
}
double tot, sum;
void dfs_collect(long long x, long long fa, long long dis, long long edge) {
  double qwq = a[x] * sqrt(dis);
  len[edge] += qwq;
  sum += qwq;
  tot += (double)a[x] * sqrt(dis) * (double)dis;
  for (int i = head[x]; i; i = p[i].next)
    if (p[i].to != fa) dfs_collect(p[i].to, x, dis + p[i].dis, edge);
}
void solve(long long x, long long al) {
  G = 0;
  find_G(x, 0, al);
  vis[x = G] = 1;
  tot = 0.0;
  sum = 0.0;
  for (long long i = head[x]; i; i = p[i].next) {
    long long y = p[i].to;
    dfs_collect(y, x, p[i].dis, i);
  }
  if (tot < ans) {
    pos = x;
    ans = tot;
  }
  for (long long i = head[x]; i; i = p[i].next) {
    long long y = p[i].to;
    if (!vis[y] && (sum - len[i] * 2.0) < 0.0) {
      solve(y, size[x] > size[y] ? size[y] : al - size[x]);
    }
  }
}
int main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
  long long x, y, z;
  ans = 1e40;
  for (long long i = 1; i < n; i++) {
    scanf("%lld%lld%lld", &x, &y, &z);
    addedge(x, y, z);
    addedge(y, x, z);
  }
  solve(1, n);
  printf("%lld %.6lf", pos, ans);
  return 0;
}
